package cn.orange.ch10_dynamicprogramming;

/**
 * LC583.两个字符串的删除操作
 */
public class LC583 {
    public int minDistance(String word1, String word2) {
        int m = word1.length();
        int n = word2.length();
        //dp[i][j]:以i-1结尾的s和以j-1结尾的t相同需要的的最小步数为dp[i][j]
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        return dp[m][n];
    }

    public static void main(String[] args) {
        LC583 alg = new LC583();
        System.out.println(alg.minDistance("a", "b"));
        System.out.println(alg.minDistance("leetcode", "etco"));
    }
}
